<div data-v-a6a58a5e="" class="contentlistwrap">
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">35 |
            Trie树：如何实现搜索引擎的搜索关键词提示功能？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-12-12</span></div>
            <img src="https://static001.geekbang.org/resource/image/04/58/04b5a7b26cd374a5c9da75e93e9d8f58.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">Trie树是一种解决字符串快速匹配问题的数据结构。</p>
            <div class="article-item-more"><a href="/column/article/72414"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/72414">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">34 |
            字符串匹配基础（下）：如何借助BM算法轻松理解KMP算法？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-12-10</span></div>
            <img src="https://static001.geekbang.org/resource/image/18/8a/18d68da702d4e53998f526c8e7732d8a.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">在所有的字符串匹配算法里，要说最知名的一种的话，那就非KMP算法莫属。</p>
            <div class="article-item-more"><a href="/column/article/71845"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/71845">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">33 |
            字符串匹配基础（中）：如何实现文本编辑器中的查找功能？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-12-07</span></div>
            <img src="https://static001.geekbang.org/resource/image/4f/16/4f5a919c1ad1d3b83c98cf94215bba16.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我们讲另一种字符串匹配算法，BM算法。</p>
            <div class="article-item-more"><a href="/column/article/71525"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/71525">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">32 |
            字符串匹配基础（上）：如何借助哈希算法实现高效字符串匹配？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-12-05</span></div>
            <img src="https://static001.geekbang.org/resource/image/b9/66/b997edcd68d6f7393275659f8653a766.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我们讲两种字符串匹配算法，BF算法和RK算法。</p>
            <div class="article-item-more"><a href="/column/article/71187"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/71187">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">31 |
            深度和广度优先搜索：如何找出社交网络中的三度好友关系？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-12-03</span></div>
            <img src="https://static001.geekbang.org/resource/image/2e/a6/2e2ee48b2c6e405a80b221f166f084a6.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">深度优先搜索算法和广度优先搜索算法都是基于“图”这种数据结构的。</p>
            <div class="article-item-more"><a href="/column/article/70891"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/70891">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">30 |
            图的表示：如何存储微博、微信等社交网络中的好友关系？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-30</span></div>
            <img src="https://static001.geekbang.org/resource/image/6c/ec/6c94ad5bc9c0402f53b6ced3d7e65fec.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我们学习图这种非线性表数据结构及其存储方式。</p>
            <div class="article-item-more"><a href="/column/article/70537"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/70537">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">29 | 堆的应用：如何快速获取到Top
            10最热门的搜索关键词？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-28</span></div>
            <img src="https://static001.geekbang.org/resource/image/0f/53/0f4151db23d0c388cd79cc7ea2602653.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我们来看，堆的三个非常重要的应用：优先级队列、求Top K和求中位数。</p>
            <div class="article-item-more"><a href="/column/article/70187"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/70187">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">28 |
            堆和堆排序：为什么说堆排序没有快速排序快？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-26</span></div>
            <img src="https://static001.geekbang.org/resource/image/fd/b2/fdd7e83c7816075a638f02f97558fbb2.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我们讲另一种完全二叉树，堆。</p>
            <div class="article-item-more"><a href="/column/article/69913"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/69913">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">不定期福利第二期 |
            王争：羁绊前行的，不是肆虐的狂风，而是内心的迷茫</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-23</span></div>
            <img src="https://static001.geekbang.org/resource/image/1f/85/1fca022ef82d07dcb93cd173026d7385.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我想分享的几个关于学习的认知。</p>
            <div class="article-item-more"><a href="/column/article/69607"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/69607">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">27 |
            递归树：如何借助树来求解递归算法的时间复杂度？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-21</span></div>
            <img src="https://static001.geekbang.org/resource/image/2f/6d/2fde598f081f84187695fbf1937c446d.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我们用递归树分析递归代码的时间复杂度。</p>
            <div class="article-item-more"><a href="/column/article/69388"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/69388">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">26 |
            红黑树（下）：掌握这些技巧，你也可以实现一个红黑树</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-19</span></div>
            <img src="https://static001.geekbang.org/resource/image/57/ed/578b1b7602a9f03a7e900145f91fa6ed.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">这节我们来看红黑树的实现过程，可能会比较复杂。</p>
            <div class="article-item-more"><a href="/column/article/68976"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/68976">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">25 |
            红黑树（上）：为什么工程中都用红黑树这种二叉树？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-16</span></div>
            <img src="https://static001.geekbang.org/resource/image/b8/5d/b87b539ee593696aa7619bb950d1205d.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">前面提了那么多次红黑树，今天我们就来讲它。</p>
            <div class="article-item-more"><a href="/column/article/68638"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/68638">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">24 |
            二叉树基础（下）：有了如此高效的散列表，为什么还需要二叉树？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-14</span></div>
            <img src="https://static001.geekbang.org/resource/image/06/8d/06f9b45611d0c76761550851fdae858d.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">我们今天来学习二叉查找树。</p>
            <div class="article-item-more"><a href="/column/article/68334"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/68334">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">23 |
            二叉树基础（上）：什么样的二叉树适合用数组来存储？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-12</span></div>
            <img src="https://static001.geekbang.org/resource/image/ab/79/abdc3641bada1a03f4444c36c1bc4879.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我们讲最常见的非线性表结构，树。</p>
            <div class="article-item-more"><a href="/column/article/67856"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/67856">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">22 |
            哈希算法（下）：哈希算法在分布式系统中有哪些应用？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-09</span></div>
            <img src="https://static001.geekbang.org/resource/image/42/7c/424e79d4fa84624b5fff2845b8c6317c.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                今天我讲三种哈希算法在分布式系统中的应用，它们分别是：负载均衡、数据分片、分布式存储。</p>
            <div class="article-item-more"><a href="/column/article/67388"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/67388">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">21 |
            哈希算法（上）：如何防止数据库中的用户信息被脱库？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-07</span></div>
            <img src="https://static001.geekbang.org/resource/image/43/9b/432360759ea2e98eb287a006cce87a9b.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">今天我会告诉你，在实际的开发中，我们该如何用哈希算法解决问题。</p>
            <div class="article-item-more"><a href="/column/article/65312"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/65312">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">20 |
            散列表（下）：为什么散列表和链表经常会一起使用？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-05</span></div>
            <img src="https://static001.geekbang.org/resource/image/a7/4f/a771ca440b52e2eca47fa72ad8a1bc4f.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                散列表是动态数据结构，不停地有数据的插入、删除。如果要按顺序遍历散列表中的数据，都要先排序，效率就会很低...</p>
            <div class="article-item-more"><a href="/column/article/64858"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/64858">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">19 |
            散列表（中）：如何打造一个工业级水平的散列表？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-11-02</span></div>
            <img src="https://static001.geekbang.org/resource/image/28/5b/28cd69b35b43faba13958ed336db425b.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                打造一个工业级水平的散列表，需要考虑三个问题：如何设计散列函数？如何根据装载因子动态扩容？如何选择散列冲...</p>
            <div class="article-item-more"><a href="/column/article/64586"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/64586">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">18 |
            散列表（上）：Word文档中的单词拼写检查功能是如何实现的？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-31</span></div>
            <img src="https://static001.geekbang.org/resource/image/b1/02/b1b5da27544870c9376004006387db02.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                散列表来源于数组，它借助散列函数对数组这种数据结构进行扩展，利用的是数组支持按照下标随机访问元素的特性。...</p>
            <div class="article-item-more"><a href="/column/article/64233"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/64233">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">17 |
            跳表：为什么Redis一定要用跳表来实现有序集合？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-29</span></div>
            <img src="https://static001.geekbang.org/resource/image/fe/2a/fe4006ffa877925d4ca389b4531f8a2a.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                很多操作红黑树和跳表一样可以完成，甚至时间复杂度也是一样的，那我们为什么要选择跳表，而不是红黑树呢？</p>
            <div class="article-item-more"><a href="/column/article/42896"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/42896">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">16 |
            二分查找（下）：如何快速定位IP对应的省份地址？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-26</span></div>
            <img src="https://static001.geekbang.org/resource/image/41/7e/411cf7910d7d0f466e0ba6dea2b74c7e.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                变体的二分查找算法写起来非常烧脑，很容易因为细节处理不好而产生Bug，这些容易出错的细节有：终止条件、区间...</p>
            <div class="article-item-more"><a href="/column/article/42733"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/42733">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">15 |
            二分查找（上）：如何用最省内存的方式实现快速查找功能？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-24</span></div>
            <img src="https://static001.geekbang.org/resource/image/ca/df/ca9c8119a7532fc8a7b249af019bf3df.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                二分查找的思想非常简单，但是看似越简单的东西往往越难掌握好，想要灵活应用就更加困难。</p>
            <div class="article-item-more"><a href="/column/article/42520"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/42520">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">14 |
            排序优化：如何实现一个通用的、高性能的排序函数？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-22</span></div>
            <img src="https://static001.geekbang.org/resource/image/5f/59/5f4a25bed43d39bccd03614486d62559.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                今天是排序算法的最后一节，会贯穿前面几节的内容。我会讲快速排序的优化策略，比如合理选择分区点、避免递归太...</p>
            <div class="article-item-more"><a href="/column/article/42359"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/42359">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">13 |
            线性排序：如何根据年龄给100万用户数据排序？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-19</span></div>
            <img src="https://static001.geekbang.org/resource/image/53/3a/538f4aefb62df6171579293a87d9ca3a.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                桶排序和计数排序的排序思想是非常相似的，都是针对范围不大的数据，将数据划分成不同的桶来实现排序。基数排序...</p>
            <div class="article-item-more"><a href="/column/article/42038"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/42038">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">12 |
            排序（下）：如何用快排思想在O(n)内查找第K大元素？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-17</span></div>
            <img src="https://static001.geekbang.org/resource/image/ae/fb/ae97df138c98e6c130f76d93c02095fb.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                归并排序和快速排序是两种稍微复杂的排序算法，它们用的都是分治的思想，代码都通过递归来实现，过程非常相似。</p>
            <div class="article-item-more"><a href="/column/article/41913"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/41913">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">11 |
            排序（上）：为什么插入排序比冒泡排序更受欢迎？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-15</span></div>
            <img src="https://static001.geekbang.org/resource/image/7c/67/7c40ffed3d9263a00af4d83198b54a67.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                分析一个排序算法，要从执行效率、内存消耗和稳定性三个方面来看。这一节我带你分析三种排序算法：冒泡排序、插...</p>
            <div class="article-item-more"><a href="/column/article/41802"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/41802">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">10 |
            递归：如何用三行代码找到“最终推荐人”？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-12</span></div>
            <img src="https://static001.geekbang.org/resource/image/e1/f4/e15d9f05aadeb469258016d0901a38f4.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">什么样的问题可以用递归来解决？如何快速写出优秀的递归代码？</p>
            <div class="article-item-more"><a href="/column/article/41440"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/41440">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">09 |
            队列：队列在线程池等有限资源池中的应用</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-10</span></div>
            <img src="https://static001.geekbang.org/resource/image/54/97/54e5575739ec277cc8f34b36157a3897.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                队列最大的特点就是先进先出，主要的两个操作是入队和出队。我主要讲几种常见的队列：循环队列、阻塞队列和并发...</p>
            <div class="article-item-more"><a href="/column/article/41330"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/41330">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">08 |
            栈：如何实现浏览器的前进和后退功能？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-08</span></div>
            <img src="https://static001.geekbang.org/resource/image/79/aa/79d1a08a0a016b4648a764fc62bed8aa.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                栈是一种操作受限的数据结构，只支持入栈和出栈操作。后进先出是它最大的特点。不管基于数组还是链表来实现栈，...</p>
            <div class="article-item-more"><a href="/column/article/41222"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/41222">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">07 |
            链表（下）：如何轻松写出正确的链表代码？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-05</span></div>
            <img src="https://static001.geekbang.org/resource/image/6b/45/6b3bb42ada9da5a6db70b0f1f4c99445.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                链表代码写得好坏，可以看出一个人写代码是否细心，考虑问题是否全面，思维是否缜密。因此我总结了写链表代码的...</p>
            <div class="article-item-more"><a href="/column/article/41149"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/41149">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">06 |
            链表（上）：如何实现LRU缓存淘汰算法?</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-03</span></div>
            <img src="https://static001.geekbang.org/resource/image/aa/25/aa5000d3a2079c75a5cbe32772d52625.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                链表和数组有什么不同？我们通过这两者的对比，来解析常见的三种链表：单链表、双向链表和循环链表。</p>
            <div class="article-item-more"><a href="/column/article/41013"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/41013">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">05 |
            数组：为什么很多编程语言中数组都从0开始编号？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-10-01</span></div>
            <img src="https://static001.geekbang.org/resource/image/78/70/78b915d2fa0d8dd8776e8e97e028f670.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                数组不仅是一种编程语言中的数据类型，还是一种最基础的数据结构。尽管数组看起来非常基础、简单，但是我估计很...</p>
            <div class="article-item-more"><a href="/column/article/40961"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/40961">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">不定期福利第一期 | 数据结构与算法学习书单</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-09-30</span></div>
            <img src="https://static001.geekbang.org/resource/image/3c/74/3cfcde276dff9e12b513a88548daf174.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                你好，我是王争。欢迎来到不定期更新的周末福利时间。今天我们来聊聊数据结构和算法学习过程中的必读书单。</p>
            <div class="article-item-more"><a href="/column/article/40681"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/40681">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">04 |
            复杂度分析（下）：浅析最好、最坏、平均、均摊时间复杂度</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-09-28</span></div>
            <img src="https://static001.geekbang.org/resource/image/9e/ee/9efe0a80fac815101324e1d4de1e49ee.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                今天我继续给你讲四个复杂度分析方面的知识点，最好情况时间复杂度、最坏情况时间复杂度、平均情况时间复杂度、...</p>
            <div class="article-item-more"><a href="/column/article/40447"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/40447">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">03 |
            复杂度分析（上）：如何分析、统计算法的执行效率和资源消耗？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-view">
                
            </i> <span class="article-item-time">2018-09-26</span></div>
            <img src="https://static001.geekbang.org/resource/image/ed/5a/edc6039771a3bdfa2ff132000710e85a.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">复杂度分析是算法的精髓。只要掌握了它，数据结构和算法的内容，基本就掌握了一半。</p>
            <div class="article-item-more"><a href="/column/article/40036"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/40036">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">02 |
            如何抓住重点，系统高效地学习数据结构与算法？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-viewed">
                
            </i> <span class="article-item-time">2018-09-24</span></div>
            <img src="https://static001.geekbang.org/resource/image/1e/d3/1ef0181f71fe1bd731f172ff3b0fc2d3.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                如果你觉得数据结构与算法很难学，可能是因为你没有找到好的学习方法，没有抓住学习的重点。今天我就带你划一划...</p>
            <div class="article-item-more"><a href="/column/article/40011"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/40011">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">01 | 为什么要学习数据结构和算法？</h2>
            <div class="article-item-hd"><i class="iconfont article-item-viewed">
                
            </i> <span class="article-item-time">2018-09-21</span></div>
            <img src="https://static001.geekbang.org/resource/image/73/9f/731fdcdef7b7d56ce7a6e0bf88a1a99f.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                你为什么要学习数据结构与算法呢？在过去的软件开发中，数据结构和算法在哪些地方帮到了你？</p>
            <div class="article-item-more"><a href="/column/article/39972"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/39972">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
    <div data-v-a6a58a5e="" class="article-item">
        <div class="article-item-wrapper"><h2 class="article-item-title">开篇词 |
            从今天起，跨过“数据结构与算法”这道坎</h2>
            <div class="article-item-hd"><i class="iconfont article-item-viewed">
                
            </i> <span class="article-item-time">2018-09-17</span></div>
            <img src="https://static001.geekbang.org/resource/image/56/49/56f17c4b9c5a3cc329ca37cc6b328c49.jpg"
                 class="article-item-cover">
            <p class="article-item-desc common-content">
                基础知识就像是一座大楼的地基，它决定了我们的技术高度。要想快速做出点事情，前提条件一定是基础能力过硬，“...</p>
            <div class="article-item-more"><a href="/column/article/39922"
                                              class="article-item-more-text"
                                              data-gk-spider-link="/column/article/39922">阅读全文</a>
                <i class="iconfont"></i></div>
        </div> <!----></div>
</div>